Characterizing classes of regular languages using prefix codes of bounded synchronization delay
نویسندگان
چکیده
منابع مشابه
Characterizing Classes of Regular Languages Using Prefix Codes of Bounded Synchronization Delay
In this paper we continue a classical work of Schützenberger on codes with bounded synchronization delay. He was interested to characterize those regular languages where the groups in the syntactic monoid belong to a variety H. He allowed operations on the language side which are union, intersection, concatenation and modified Kleene-star involving a mapping of a prefix code of bounded synchron...
متن کاملCharacterizing the Regular Prefix Codes and Right Power-Bounded Languages
This paper was motivated by the work of Thierrin [8], where right power-bounded languages are introduced as those languages L having an upper bound n so that k < n whenever uvk E L with v # X. Such languages are related to various versions of noncounting languages (see, e.g. [ 1,6]). Two natural questions about the family R of regular right-power bounded languages are, first, a characterization...
متن کاملRetrograde Codes and Bounded Synchronization Delay
We study how the concept of bounded synchronization delay is related to retrograde comma-free codes. Retrograde codes are a subclass of comma-free codes in which the dictionary of code words excludes not only overlaps of code words but also reversals of overlaps. We give a general upper bound on the maximum size of a retrograde comma-free distionary, provide a construction for a bounded synchro...
متن کاملPrefix Distance Between Regular Languages
The prefix distance between two words x and y is defined as the number of symbol occurrences in the words that do not belong to the longest common prefix of x and y. We show how to model the prefix distance using weighted transducers. We use the weighted transducers to compute the prefix distance between two regular languages by a transducer-based approach originally used by Mohri for an algori...
متن کاملState Complexity of Prefix-Free Regular Languages
We investigate the state complexities of basic operations for prefix-free regular languages. The state complexity of an operation for regular languages is the number of states that are necessary and sufficient in the worst-case for the minimal deterministic finite-state automaton (DFA) that accepts the language obtained from the operation. We know that a regular language is prefix-free if and o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Algebra and Computation
سال: 2017
ISSN: 0218-1967,1793-6500
DOI: 10.1142/s021819671750028x